Grover’s Quantum Search Based Data Detection Algorithm for MIMO System
نویسندگان
چکیده
Abstract Maximum like-lihood (ML) algorithm is the optimal detection scheme for the data detection of multiple-input multiple-output (MIMO) communication systems, but it has a high complexity in its preprocessing. For good performance and low complexity, a new Grover’s Quantum Search (GS) based data detection algorithm for MIMO system is proposed. It can increase the probability amplitude of solutions while reducing the probability amplitude of non-solutions. By Grover’s iterative process, the probability amplitude of solutions can reach maximum. So it can get the solutions after measurement with a high probability. The simulation results show that the proposed data detection algorithm for MIMO system has a very close to ML based data detection in Bit Error Rate (BER) performance, but it has lower complexity than ML based data detection algorithm.
منابع مشابه
An Improved Semi-blind Joint Data Detection and Channel Estimation Algorithm for MIMO-OFDM System
In this paper, a new Semi-blind joint Grover’s Quantum Search (GS) based data detection and Space-Alternating Generalized Expectation-maximization (SAGE) channel estimation algorithm for Multiple-Input Multiple-Output (MIMO)-Orthogonal frequency division multiplexing (OFDM) system is proposed. According to the training symbols inserted in the head of sub-frame, we get the initial estimation of ...
متن کاملCan Quantum Entanglement Detection Schemes Improve Search?
Quantum computation, in particular Grover’s algorithm, has aroused a great deal of interest since it allows for a quadratic speedup to be obtained in search procedures. Classical search procedures for an N element database require at most O(N) time complexity. Grover’s algorithm is able to find a solution with high probability in O( √ N ) time through an amplitude amplification scheme. In this ...
متن کاملAn Intuitive Hamiltonian for Quantum Search
We present new intuition behind Grover’s quantum search algorithm by means of a Hamiltonian. Given a black-box Boolean function f : {0, 1}n → {0, 1} such that f(w) = 1 for exactly one w ∈ {0, 1}n, Grover [4] describes a quantum algorithm that finds w in O(2) time. Farhi & Gutmann [3] show that w can also be found in the same amount time by letting the quantum system evolve according to a simple...
متن کاملSimilarity between Grover’s quantum search algorithm and classical two-body collisions
By studying the diffusion operator in Grover’s quantum search algorithm, we find a mathematical analogy between quantum searching and classical, elastic two-body collisions. We exploit this analogy using a thought experiment involving multiple collisions between two-bodies to help illuminate why Grover’s quantum search algorithm works. Related issues are discussed. PACS numbers: 03.67. Quantum ...
متن کاملAn information-theoretic analysis of Grover’s algorithm
Grover discovered a quantum algorithm for identifying a target element in an unstructured search universe of N items in approximately π/4 √ N queries to a quantum oracle. For classical search using a classical oracle, the search complexity is of order N/2 queries since on average half of the items must be searched. In work preceding Grover’s, Bennett et al. had shown that no quantum algorithm c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012